Experiments in Automating Hardware Veriication Using Inductive Proof Planning
نویسندگان
چکیده
We present a new approach to automating the veriication of hardware designs based on planning techniques. A database of methods is developed that combines tactics, which construct proofs, using speciic-ations of their behaviour. Given a veriication problem, a planner uses the method database to build automatically a specialised tactic to solve the given problem. User interaction is limited to specifying circuits and their properties and, in some cases, suggesting lemmas. We have implemented our work in an extension of the Clam proof planning system. We report on this and its application to verifying a variety of combinational and synchronous sequential circuits including a parameterised multiplier design and a simple computer microprocessor.
منابع مشابه
Experiments in Automating Hardware Verification Using Inductive Proof Planning
We present a new approach to automating the veriication of hardware designs based on planning techniques. A database of methods is developed that combines tactics, which construct proofs, using speciications of their behaviour. Given a veriication problem, a planner uses the method database to build automatically a specialised tactic to solve the given problem. User interaction is limited to sp...
متن کاملToward a Super Duper Hardware Tactic
We present techniques for automating many of the tedious aspects of hardware veriication in a higher order logic theorem proving environment. We employ two complementary approaches. The rst involves intelligent tactics which incorporate many of the smaller steps currently applied by the user. The second uses hardware combinators to partially automate inductive proofs for iterated hardware struc...
متن کاملProof planning for automating hardware verification
1997 i Abstract In this thesis we investigate the applicability of proof planning to automate the veri-cation of hardware systems. Proof planning is a meta-level reasoning technique which captures patterns of proof common to a family of theorems. It contributes to the automation of proof by incorporating and extending heuristics found in the Nqthm theorem prover and using them to guide a tactic...
متن کاملInvariant Discovery via Failed Proof Attempts
We present a framework for automating the discovery of loop invariants based upon failed proof attempts. The discovery of suitable loop invariants is a bottle neck for automatic veriication of imperative programs. Using the proof planning framework we reconstruct standard heuristics for developing invariants. We relate these heuristics to the analysis of failed proof attempts allowing us to dis...
متن کاملMiddle - Out Reasoning for LogicProgram
We propose a novel approach to automating the synthesis of logic programs: Logic programs are synthesized as a by-product of the planning of a veriication proof. The approach is a two-level one: At the object level, we prove program veriication conjectures in a sorted, rst-order theory. The conjectures are of the form 8args ????! : prog(args ????!) $ spec(args ????!). At the meta-level, we plan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996